Automated Combinatorial Test Methods - Beyond Pairwise Testing
نویسندگان
چکیده
Pairwise testing has become a popular approach to software quality assurance because it often provides effective error detection at low cost. However, pairwise (2-way) coverage is not sufficient for assurance of mission-critical software. Combinatorial testing beyond pairwise is rarely used because good algorithms have not been available for complex combinations such as 3 way, 4-way, or more. In addition, significantly more tests are required for combinations beyond pairwise testing , and testers must determine expected results for each set of inputs. This article introduces new tools for automating the production of com plete test cases covering up to 6-way combinations.
منابع مشابه
Practical Combinatorial Testing Approaches: A Case Study of a University Portal Application
Time and quality are important factors when determining the proper approach for software testing. A software program can often be used in various environments (different platforms, operating systems, browsers, networks, etc.) and require thorough testing to provide high quality and reliability in different configurations. Combinatorial testing is an effective approach to testing hardware and so...
متن کاملPairwise Testing: A Best Practice That Isn’t
Pairwise testing is a wildly popular approach to combinatorial testing problems. The number of articles and textbooks covering the topic continues to grow, as do the number of commercial and academic courses that teach the technique. Despite the technique's popularity and its reputation as a best practice, we find the technique to be over promoted and poorly understood. In this paper, we define...
متن کاملA Cuckoo Search Based Pairwise Strategy for Combinatorial Testing Problem
Combinatorial Testing (CT) is a sampling technique to generate test cases with a focus on the behavior of interaction system's components with their collaborators. Given its effectiveness to reveal faults, pairwise testing has often been chosen to perform the required sampling of test cases. The main concern for pairwise testing is to obtain the most optimal test sets (i.e. pairwise dictates th...
متن کاملAnatomy of the Parallel Tree Based Strategy for High Strength Interaction Testing
Software and hardware testers concentrate on how to minimize the time involved in testing at the same time to ensure that the system is also tested well and made acceptable. This paper has enhanced and explained in details our previous strategy “A Tree Based Strategy for Test Data Generation and Cost Calculation for Pairwise Combinatorial Interaction Testing” to work effectively in parallel and...
متن کاملClassic algorithms for Pairwise Testing
This paper gives an overview on the most important classic algorithms for pairwise testing. All algorithms use combinatorial strategies to find a test set, which covers pairwise combinations of system parameters (for example system settings or inputs from the user). The idea of pairwise testing is already 20 years old but for the last five years its popularity has been rising extremely. The rea...
متن کامل